NP-complete problems - PDFSEARCH.IO - Document Search Engine

NP-complete problems
Results: 1536

#	Item
341	Nature Precedings : doi:npre : Posted 3 AprMining the Largest Quasi-clique in Human Protein Interactome Paper ID: 211 Sanghamitra Bandyopadhyay Add to Reading List Source URL: precedings.nature.com Language: English NP-complete problems Bioinformatics Clique Interactome Nature Precedings Theoretical computer science Mathematics Applied mathematics
342	Vertex Cover Gets Faster and Harder on Low Degree Graphs Akanksha Agrawal1 , Sathish Govindarajan1 , Neeldhara Misra1 Indian Institute of Science, Bangalore {akanksha.agrawal\|gsat\|neeldhara}@csa.iisc.ernet.in Add to Reading List Source URL: drona.csa.iisc.ernet.in Language: English - Date: 2014-08-01 08:33:48 NP-complete problems Vertex cover Vertex Graph Hamiltonian path Tree Clique Neighbourhood Connectivity Graph theory Mathematics Theoretical computer science
343	CME 305: Discrete Mathematics and Algorithms 1 Approximation Algorithms Add to Reading List Source URL: stanford.edu Language: English - Date: 2015-03-23 01:44:41 Operations research Computational complexity theory NP-complete problems Job shop scheduling Mathematical optimization Approximation algorithm Linear programming Algorithm Vertex cover Theoretical computer science Applied mathematics Mathematics
344	KaHIP v0.71 – Karlsruhe High Quality Partitioning User Guide Peter Sanders and Christian Schulz Karlsruhe Institute of Technology (KIT), Karlsruhe, Germany Email: {sanders, christian.schulz}@kit.edu Add to Reading List Source URL: algo2.iti.kit.edu Language: English - Date: 2015-01-03 02:07:55 Graph Graph coloring Planar separator theorem Path decomposition Graph theory NP-complete problems Graph partition
345	Kannan and Wheeler Algorithms for Molecular Biology 2012, 7:9 http://www.almob.org/contentRESEARCH Open Access Add to Reading List Source URL: www.almob.org Language: English Phylogenetics NP-complete problems Graph Maximum parsimony Routing algorithms Tree Phylogenetic network Steiner tree problem Directed acyclic graph Graph theory Mathematics Theoretical computer science
346	CS 170 Algorithms Spring 2009 Add to Reading List Source URL: www-inst.eecs.berkeley.edu Language: English - Date: 2009-05-04 23:56:17 Complexity classes NP-complete problems Boolean algebra Electronic design automation Formal methods Boolean satisfiability problem Conjunctive normal form NP-complete Canonical form Theoretical computer science Mathematics Applied mathematics
347	An O(log n/ log log n)-approximation Algorithm for the Asymmetric Traveling Salesman Problem Arash Asadpour∗ ‡ Michel X. Goemans† Add to Reading List Source URL: www.stanford.edu Language: English - Date: 2009-10-28 12:34:47 Spanning tree Loop-erased random walk Minimum spanning tree Chernoff bound Eulerian path NP-complete problems Dominating set Tutte polynomial Graph theory Mathematics Theoretical computer science
348	Technical Report TTIC-TRMarch 2010 Dynamic Well-Spaced Point Sets Umut A. Acar Add to Reading List Source URL: www.ttic.edu Language: English - Date: 2012-09-18 12:01:28 NP-complete problems Delaunay triangulation Triangulation Voronoi diagram Discrete mathematics Mathematics Theoretical computer science Computational geometry
349	Tree-based Coarsening and Partitioning of Complex Networks Roland Glantz, Henning Meyerhenke, and Christian Schulz arXiv:1402.2782v2 [cs.DS] 13 Feb 2014 Add to Reading List Source URL: arxiv.org Language: English - Date: 2014-02-13 20:08:15 Graph connectivity Combinatorial optimization Spanning tree NP-complete problems Graph partition Vertex Minimum spanning tree Edge contraction Tree Graph theory Mathematics Theoretical computer science
350	CME 305: Discrete Mathematics and Algorithms Instructor: Reza Zadeh () HW#3 – Due at the beginning of class ThursdayConsider a model of a nonbipartite undirected graph in which two partic Add to Reading List Source URL: stanford.edu Language: English - Date: 2015-03-23 01:42:07 NP-complete problems Clique problem Vertex cover Matching Eulerian path Clique Minimum spanning tree Randomized algorithm Connectivity Graph theory Theoretical computer science Mathematics

UPDATE